On the Maximal Number of Independent Circuits in a Graph

In a recent paper [l] K . CORRÁDI and A. HAJNAL proved that if a finite graph without multiple edges contains at least 3k vertices and the valency of every vertex is at least 2k, where k is a positive integer, then the graph contains k independent circuits, i . e . the graph contains as a subgraph a set of k circuits no two of which have a vertex in common . The present paper contains extensions of this theorem. In a recent paper [2] P . ERDŐS and L. PÓSA proved, among other things, that if a finite graph with or without loops and multiple edges contains n vertices and at least n + 4 edges, then the graph contains two circuits without an edge in common . The present paper contains analogous results for planar graphs . We adopt the following notation : O k denotes a graph consisting of k independent circuits, kO denotes a graph consisting of k or more circuits no two of which have an edge in common . If q is a graph then 'V (q) denotes the set of vertices of q, `V i(q ) denotes the set of vertices of q having valency i in q (i being a non-negative integer), T 5 i (q), Ty i (q) denote the set of vertices of 4 having valency i and ' i, respectively, and &(q) denotes the set of edges of c~ . The valency of the vertex x in the graph will be denoted by v (x, C~) . I ? (() I will be denoted by V (q), J & (q) I by E(q) etc. In this notation the theorem Of CORRÁDI and HAJNAL quoted above states that if q is a finite graph without multiple edges and if V(q) 3k and T -2k_ 1 (4) =0, then q Ok ; and the theorem of ERDÖS and PÓSA quoted above states that if is a finite graph and E(C) _V(q) + 4, then qD 2 O .